The Construction of Maximal Orders Over a Dedekind Domain
نویسنده
چکیده
Suppose R is a complete local Dedekind domain with quotient field F, and let f(x) be a monic polynomial in R[x] having non-zero discriminant. We present here a new algorithm to construct the maximal order of the algebra Af = F[x]/f(x)F[x]. The new algorithm incorporates ideas of Zassenhaus (1975, 1980) concerning P-adic stability and the algebraic decomposition of A s . We show that it is always possible either
منابع مشابه
ON COMULTIPLICATION AND R-MULTIPLICATION MODULES
We state several conditions under which comultiplication and weak comultiplication modulesare cyclic and study strong comultiplication modules and comultiplication rings. In particular,we will show that every faithful weak comultiplication module having a maximal submoduleover a reduced ring with a finite indecomposable decomposition is cyclic. Also we show that if M is an strong comultiplicati...
متن کاملAlmost uniserial modules
An R-module M is called Almost uniserial module, if any two non-isomorphic submodules of M are linearly ordered by inclusion. In this paper, we investigate some properties of Almost uniserial modules. We show that every finitely generated Almost uniserial module over a Noetherian ring, is torsion or torsionfree. Also the construction of a torsion Almost uniserial modules whose first nonzero Fit...
متن کاملA Note on Superamorphous Sets and Dual Dedekind-Infinity
In the absence of the axiom of choice there are several possible nonequivalent ways of translating the intuitive idea of “infinity” into a mathematical definition. In [10], Tarski investigated some natural infinity notions notions, and his research was continued by Levy [8], Truss [12], Spǐsiak and Vojtas [9], Howard and Yorke [4] and others. The most prominent definitions of finiteness are the...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 4 شماره
صفحات -
تاریخ انتشار 1987